Hamming Star-Convexity Packing in Information Storage
نویسندگان
چکیده
A major puzzle in neural networks is understanding the information encoding principles that implement the functions of the brain systems. Population coding in neurons and plastic changes in synapses are two important subjects in attempts to explore such principles. This forms the basis of modern theory of neuroscience concerning self-organization and associative memory. Here we wish to suggest an information storage scheme based on the dynamics of evolutionary neural networks, essentially reflecting the meta-complication of the dynamical changes of neurons as well as plastic changes of synapses. The information storage scheme may lead to the development of a complete description of all the equilibrium states fixed points of Hopfield networks, a spacefilling network that weaves the intricate structure of Hamming star-convexity, and a plasticity regime that encodes information based on algorithmic Hebbian synaptic plasticity.
منابع مشابه
Maximal partial packings of Z2n with perfect codes
Abstract A maximal partial Hamming packing of Zn 2 is defined by us to be a family S of mutually disjoint translates of Hamming codes of length n, such that any translate of any Hamming code of length n intersects at least one of the translates of Hamming codes in S. The number of translates of Hamming codes in S is the packing number, and a partial Hamming packing is strictly partial if the fa...
متن کاملAn improvement of the asymptotic Elias bound for non-binary codes
For non-binary codes the Elias bound is a good upper bound for the asymptotic information rate at low relative minimum distance, where as the Plotkin bound is better at high relative minimum distance. In this work, we obtain a hybrid of these bounds which improves both. This in turn is based on the anticode bound which is a hybrid of the Hamming and Singleton bounds and improves both bounds. Th...
متن کاملOn the Basic Averaging Arguments for Linear Codes
Linear codes over Fq are considered for use in detecting and in correcting the additive errors in some subset E of Fn q . (The most familiar example of such an error set E is the set of all n-tuples of Hamming weight at most t.) In this set-up, the basic averaging arguments for linear codes are reviewed with emphasis on the relation between the combinatorial and the information-theoretic viewpo...
متن کاملA Survey on Packing and Covering Problems in the Hamming Permutation Space
Consider the symmetric group Sn equipped with the Hamming metric dH . Packing and covering problems in the finite metric space (Sn, dH) are surveyed, including a combination of both.
متن کاملEffect of vacuum-packing method on the shelf – life of Capoeta umbla sausages
The effect of vacuum packing on the shelf-life of sausages produced from Capoeta umbla were investigated during storage periods. For this purpose, microbial, chemical and sensory changes were analyzed throughout the storage time. The microbial flora of the sausages comprised mainly mesophilic bacteria, psychrotrophic bacteria, lactic acid bacteria, yeast and molds. Escherichia coli, Staphylcocc...
متن کامل